package br.edu.unifei.mestrado.greedy;

import br.edu.unifei.mestrado.commons.graph.GraphWrapper;
import br.edu.unifei.mestrado.commons.partition.AbstractPartition;
import br.edu.unifei.mestrado.commons.partition.AbstractPartitionIndex;
import br.edu.unifei.mestrado.mem.graph.PartitionIndexMem;

public class GreedyNeoDB extends GreedyKWay {

	private GraphWrapper grafo = null;

	public GreedyNeoDB(GraphWrapper newGraph) {
		// UTIL: O KL não reusa o banco, pq ele particiona o grafo mais contraido.
		grafo = newGraph;
	}

	@Override
	protected GraphWrapper getGrafo() {
		return grafo;
	}
	
	@Override
	public AbstractPartitionIndex getPartitionIndex() {
		//TODO: verificar pq aqui está usando memoria
		return new PartitionIndexMem(AbstractPartition.TWO_WAY);
	}
	
	//métodos da view

	@Override
	public void initView(GraphWrapper initialGraph) {
	}

	@Override
	public void setShowView(boolean showView) {
	}

	@Override
	public void updateView(GraphWrapper grafo, String it, int cutWeight) {
	}

	@Override
	public void repaint() {
	}
}
